On Parallel CRC Computations
نویسندگان
چکیده
We propose a recursive formula for computing the remainder of a Euclidean division of polynomials (with binary coefficients), which operates in parallel on w bits at a time and takes t new incoming bits at each stage. We use this formula to design a fast parallel Cyclic Redundancy Check (CRC) system which is a look-ahead scheme that trades in arbitrary depth (processing time per cycle) and throughput (total number of bits processed per cycle) for larger computation width (total number of bits the system operates on).
منابع مشابه
A Systematic Approach for Parallel CRC Computations
Cyclic redundancy codes (CRCs) form a powerful class of codes suited especially for the detection of burst errors in data storage and communication applications. In the traditional hardware implementation, a simple shift-register-based circuit performs the computation by handling the data one bit at a time. Parallel implementation can perform the necessary logic operations much faster than the ...
متن کاملDesign of Parallel Crc Generation for High Speed Application
Error detection is important whenever there is a non-zero chance of data getting corrupted. A Cyclic Redundancy Check (CRC) is the remainder, or residue, of binary division of a potentially long message, by a CRC polynomial. This technique is ubiquitously employed in communication and storage applications due to its effectiveness at detecting errors and malicious tampering. The hardware impleme...
متن کاملDesign and Implementation of Parallel CRC Generation for High Speed Application
CRC is playing a main role in the networking environment to detect the errors. With challenging the speed of transmitting data to synchronize with speed, it is essential to increase speed of CRC generation. Most electronics engineers are familiar with the cyclic redundancy check (CRC).In the era of high speed data transmission, there requires a lot of accuracy for the message to be sent correct...
متن کاملParleda: a Library for Parallel Processing in Computational Geometry Applications
ParLeda is a software library that provides the basic primitives needed for parallel implementation of computational geometry applications. It can also be used in implementing a parallel application that uses geometric data structures. The parallel model that we use is based on a new heterogeneous parallel model named HBSP, which is based on BSP and is introduced here. ParLeda uses two main lib...
متن کاملAn Optimal Software Framework for Parallel Computation of CRC
CRC is a common error detection method used in different areas such as information storage and data communication. CRC depends on modulo-2 division by a predetermined divisor called the generator. In this method, the transmitter divides the message by the generator and concatenates the calculated residue to the message. CRC is not able to detect every kind of errors. The properties of the gener...
متن کامل